Size of weakly saturated graphs
نویسنده
چکیده
Let P be a hereditary property. Let kP(G) denote the number of forbidden subgraphs, which are contained in G. A graph G is said to be weakly P-saturated, if G ∈ P and the edges of the complement of G can be labelled e1, e2, . . . , el in such way that for i= 0, 1, . . . , l− 1 the inequality kP(Gi+1)> kP(Gi) holds, whereG0=G,Gi+1=Gi + ei andGl =Kn. The minimum possible size of weakly P-saturated graphs is denoted by wsat(n,P). In this paper we shall investigate some properties of weakly saturated graphs.We provide some estimations for the minimum size of weakly P-saturated graphs. © 2006 Elsevier B.V. All rights reserved. MSC: 05C15; 05C35
منابع مشابه
Weak saturation numbers for multiple copies
For a fixed graph F , a graph G is F-saturated if there is no copy of F in G, but for any edge e ∉ G, there is a copy of F inG+e. Theminimumnumber of edges in an F-saturated graph of order nwill be denoted by sat(n, F). A graph G is weakly F-saturated if G contains no copy of F and there is an ordering of the missing edges of G so that if they are added one at a time, each edge added creates a ...
متن کاملWeakly P-saturated graphs
For a hereditary property P let kP(G) denote the number of forbidden subgraphs contained in G. A graph G is said to be weakly Psaturated, if G has the property P and there is a sequence of edges of G, say e1, e2, . . . , el, such that the chain of graphs G = G0 ⊂ G0+e1 ⊂ G1 + e2 ⊂ . . . ⊂ Gl−1 + el = Gl = Kn (Gi+1 = Gi + ei+1) has the following property: kP(Gi+1) > kP(Gi), 0 ≤ i ≤ l − 1. In thi...
متن کاملWeak saturation numbers for sparse graphs
For a fixed graph F , a graph G is F -saturated if there is no copy of F in G, but for any edge e 6∈ G, there is a copy of F in G+ e. The minimum number of edges in an F -saturated graph of order n will be denoted by sat(n, F ). A graph G is weakly F -saturated if there is an ordering of the missing edges of G so that if they are added one at a time, each edge added creates a new copy of F . Th...
متن کاملWeakly Noetherian Leavitt Path Algebras
We study row-finite Leavitt path algebras. We characterize the row-finite graphs E for which the Leavitt path algebra is weakly Noetherian. Our main result is that a Leavitt path algebra is weakly Noetherian if and only if there is ascending chain condition on the hereditary and saturated closures of the subsets of the vertices of the graph E.
متن کاملCanonizable Partial Order Generators and Regular Slice Languages
In a previous work we introduced slice graphs as a way to specify both infinite languages of directed acyclic graphs (DAGs) and infinite languages of partial orders. Therein we focused on the study of Hasse diagram generators, i.e., slice graphs that generate only transitive reduced DAGs. In the present work we show that any slice graph can be transitive reduced into a Hasse diagram generator r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 307 شماره
صفحات -
تاریخ انتشار 2007